Decapoda and Stomatopoda (Crustacea) of Rodos island (Greece) and the Erythrean expansion NW of the Levantine sea

The Decapoda and Stomatopoda (Crustacea) of the sublittoral zone of Rodos island were studied between 1995 and 2000. Twenty-five sites, at depths ranging from the intertidal to 119 m, were sampled. Three species of stomatopods and 52 species of decapods were identified, bringing the number of decapods known from Rodos to 83. One Stomatopode and nineteen decapods, though previously known from the Aegean Sea, are new records for Rodos. The presence of seven species of Erythrean origin testify to a trend of increasing tropicalization of the area. A remarkable number of Erythrean taxa (fish, Crustacea, Mollusca, Polychaeta) have been established in Rodos, the Dodecanese and the southern Aegean Sea, whereas few reached the northern Aegean and the Ionian Seas. The expansion of the Erythrean species NW of the Levantine Sea is discussed

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time

We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple $O(m n)$-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time $O(n^2)$. For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an $O(m^2 / \log{n})$-time algorithm for 2-edge strongly connected components, and thus improve over the $O(m n)$ running time also when $m = O(n)$. Our approach extends to k-edge and k-vertex strongly connected components for any constant k with a running time of $O(n^2 \log^2 n)$ for edges and $O(n^3)$ for vertices

Pattern Matching in Multiple Streams

We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while still reporting matches quickly. We give almost matching upper and lower space bounds for three distinct pattern matching problems. For exact matching we show that the problem can be solved in constant time per arriving symbol and O(m+s) words of space. For the k-mismatch and k-difference problems we give O(k) time solutions that require O(m+ks) words of space. In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor. Finally we set out a number of open problems related to this new model for pattern matching.Comment: 13 pages, 1 figur

String Indexing for Patterns with Wildcards

We consider the problem of indexing a string $t$ of length $n$ to report the occurrences of a query pattern $p$ containing $m$ characters and $j$ wildcards. Let $occ$ be the number of occurrences of $p$ in $t$, and $\sigma$ the size of the alphabet. We obtain the following results. - A linear space index with query time $O(m+\sigma^j \log \log n + occ)$. This significantly improves the previously best known linear space index by Lam et al. [ISAAC 2007], which requires query time $\Theta(jn)$ in the worst case. - An index with query time $O(m+j+occ)$ using space $O(\sigma^{k^2} n \log^k \log n)$, where $k$ is the maximum number of wildcards allowed in the pattern. This is the first non-trivial bound with this query time. - A time-space trade-off, generalizing the index by Cole et al. [STOC 2004]. We also show that these indexes can be generalized to allow variable length gaps in the pattern. Our results are obtained using a novel combination of well-known and new techniques, which could be of independent interest

Abscesses due to mycobacterium abscessus linked to injection of unapproved alternative medication.

An unlicensed injectable medicine sold as adrenal cortex extract (ACE*) and distributed in the alternative medicine community led to the largest outbreak of Mycobacterium abscessus infections reported in the United States. Records from the implicated distributor from January 1, 1995, to August 18, 1996, were used to identify purchasers; purchasers and public health alerts were used to identify patients. Purchasers and patients were interviewed, and available medical records were reviewed. Vials of ACE* were tested for mycobacterial contamination, and the product was recalled by the U.S. Food and Drug Administration. ACE* had been distributed to 148 purchasers in 30 states; 87 persons with postinjection abscesses attributable to the product were identified. Patient and vial cultures contained M. abscessus identical by enzymatic and molecular typing methods. Unusual infectious agents and alternative health practices should be considered in the diagnosis of infections that do not respond to routine treatment

Burden of herpes zoster requiring hospitalization in Spain during a seven-year period (1998–2004)

<p>Abstract</p> <p>Background</p> <p>A thorough epidemiological surveillance and a good understanding of the burden of diseases associated to VZV are crucial to asses any potential impact of a prevention strategy. A population-based retrospective epidemiological study to estimate the burden of herpes zoster requiring hospitalization in Spain was conducted.</p> <p>Methods</p> <p>This study was conducted by using data from the national surveillance system for hospital data, Conjunto Mínimo Básico de Datos (CMBD). Records of all patients admitted to hospital with a diagnosis of herpes zoster (ICD-9-MC codes 053.0–053.9) during a 7-year period (1998–2004) were selected.</p> <p>Results</p> <p>A total of 23,584 hospitalizations with a primary or secondary diagnosis of herpes zoster in patients ≥ 30 years of age were identified during the study period. Annually there were 13.4 hospitalizations for herpes zoster per 100,000 population in patients ≥ 30 years of age. The rate increases with age reaching a maximum in persons ≥ 80 years of age (54.3 admissions per 100,000 population >80 years of age). The mean cost of a hospitalization for herpes zoster in adult patients was 3,720 €. The estimated annual cost of hospitalizations for herpes zoster in patients ≥ 30 years of age in Spain was 12,731,954 €.</p> <p>Conclusion</p> <p>Herpes zoster imposes an important burden of hospitalizations and result in large cost expenses to the Spanish National Health System, especially in population older than 50 years of age</p

Serotonin 5-HT4 receptor boosts functional maturation of dendritic spines via RhoA-dependent control of F-actin

Activity-dependent remodeling of excitatory connections underpins memory formation in the brain. Serotonin receptors are known to contribute to such remodeling, yet the underlying molecular machinery remains poorly understood. Here, we employ high-resolution time-lapse FRET imaging in neuroblastoma cells and neuronal dendrites to establish that activation of serotonin receptor 5-HT4 (5-HT4R) rapidly triggers spatially-restricted RhoA activity and G13-mediated phosphorylation of cofilin, thus locally boosting the filamentous actin fraction. In neuroblastoma cells, this leads to cell rounding and neurite retraction. In hippocampal neurons in situ, 5-HT4R-mediated RhoA activation triggers maturation of dendritic spines. This is paralleled by RhoA-dependent, transient alterations in cell excitability, as reflected by increased spontaneous synaptic activity, apparent shunting of evoked synaptic responses, and enhanced long-term potentiation of excitatory transmission. The 5-HT4R/G13/RhoA signaling thus emerges as a previously unrecognized molecular pathway underpinning use-dependent functional remodeling of excitatory synaptic connections

Epidemiological characteristics of varicella from 2000 to 2008 and the impact of nationwide immunization in Taiwan

[[abstract]]Background: Varicella has an important impact on public health. Starting in 2004 in Taiwan, nationwide free varicella vaccinations were given to 1-year-old children.Methods: Our study investigated the epidemiological characteristics of varicella from 2000 to 2008, and assessed the change of varicella epidemiology after the mass varicella immunization. ICD-9-CM codes related to varicella or chickenpox (052, 052.1, 052.2, 052.7, 052.8, 052.9) were analyzed for all young people under 20 years of age through the National Health Insurance database of Taiwan from 2000 to 2008.Results: Case numbers of varicella or chickenpox significantly declined after the nationwide immunization in 2004. Winter, particularly January, was the epidemic season of varicella. We found a significant post-vaccination decrease in incidence among preschool children, especially 3 to 6 year-old children-- the peak incidence was 66 per thousand for 4 and 5 year-old children before the nationwide immunization (2000 to 2003), and the peak incidence was 23 per thousand for 6 year-old children in 2008 (p < 0.001). Varicella-related hospitalization also significantly decreased in children younger than 6 years after the nationwide immunization.Conclusion: The varicella annual incidence and varicella-related hospitalization markedly declined in preschool children after nationwide varicella immunization in 2004

A basic analysis toolkit for biological sequences

This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave gap cost functions. Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation. None of the algorithms is new, but although they are generally regarded as fundamental for sequence analysis, they have not been implemented in a single and consistent software package, as we do here. Therefore, our main contribution is to fill this gap between algorithmic theory and practice by providing an extensible and easy to use software library that includes algorithms for the mentioned string matching and alignment problems. The library consists of C/C++ library functions as well as Perl library functions. It can be interfaced with Bioperl and can also be used as a stand-alone system with a GUI. The software is available at under the GNU GPL